Planarity of the 2-Level Cactus Model

نویسندگان

  • Sabine Cornelsen
  • Yefim Dinitz
  • Dorothea Wagner
چکیده

The 2-level cactus introduced by Dinitz and Nutov in [5] is a data structure that represents the minimum and minimum+1 edgecuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used, e.g., in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of G is planar if the cardinality of a minimum edge-cut of G is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nutritional Value of BRS Capiaçu Grass (Pennisetum purpureum) Silage Associated with Cactus Pear

The objective of this study was to evaluate the best level of inclusion of cactus pear in the ensiling of elephant grass Brazil seeds (BRS) capiaçu (Pennisetum purpureum), its effects on fermentative characteristics; and nutritional value. Experimental treatments consisted of BRS capiaçu grass silage with five levels of inclusion of cactus pear (0, 5, 10, 15 and 20% inclusion as fresh ...

متن کامل

Ordered Level Planarity and Geodesic Planarity

We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We show NP-completeness even for the spe...

متن کامل

Circle planarity of level graphs

In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing. Our algorithms use and generalise PQ-trees, which are a data structure for efficient planarity tests. A graph is a level graph, if it has a part...

متن کامل

Testing Cyclic Level and Simultaneous Level Planarity

In this paper we prove that testing the cyclic level planarity of a cyclic level graph is a polynomial-time solvable problem. This is achieved by introducing and studying a generalization of this problem, which we call cyclic T -level planarity. Moreover, we show a complexity dichotomy for testing the simultaneous level planarity of a set of level graphs, with respect to both the number of leve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001